Sustainable Group Sizes for Multi-Agent Search-and-Patrol Teams
نویسندگان
چکیده
We identify sustainable sizes for a multi-agent system that consists of two classes of agents: one class is responsible for searching an area; the other for providing perimeter security for that area. In this context, sustainability means the ability of the system to accomplish the task while balancing shared resources. Bio-inspired rules based on the pride structures of African lions are developed to determine the sustainability of a group size.
منابع مشابه
A multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کاملStochastic Planning in Large Search Spaces
Multi-agent planning approaches are employed for many problems including task allocation, surveillance and video games. In the first part of my thesis, we study two multi-robot planning problems, i.e. patrolling and task allocation. For the patrolling problem, we present a novel stochastic search technique, Monte Carlo Tree Search with Useful Cycles, that can generate optimal cyclic patrol poli...
متن کاملAn Experimental Multi-Agent Robot System for Operating in Hazardous Environments
In this paper, a multi-agent robot system is presented. The system consists of four robots. The developed robots are able to automatically enter and patrol a harmful environment, such as the building infected with virus or the factory with leaking hazardous gas. Further, every robot is able to perform obstacle avoidance and search for the victims. Several operation modes are designed: remote co...
متن کاملCompetitive Two Team Target Search Game with Communication Symmetry and Asymmetry
We study a search game in which two multiagent teams compete to find a stationary target at an unknown location. Each team plays a mixed strategy over the set of search sweep-patterns allowed from its respective random starting locations. Assuming that communication enables cooperation we find closed-form expressions for the probability of winning the game as a function of team sizes, and vs. t...
متن کاملSearch Reduction in Hierarchical Distributed
Knoblock and Korf have determined that abstraction can reduce search at a single agent from exponential to linear complexity Knoblock, 1991; Korf, 1987]. We extend their results by showing how concurrent problem solving among multiple agents using abstraction can further reduce search to logarithmic complexity. We empirically validate our formal analysis by showing that it correctly predicts pe...
متن کامل